On Glivenko Congruence of a 0-Distributive Nearlattice

نویسنده

  • Md. Zaidur Rahman
چکیده

In this paper the authors have studied the Glivenko congruence R in a 0-distributive nearlattice S defined by " () R b a ≡ if and only if 0 = ∧ x a is equivalent to 0 = ∧ x b for each S x ∈ ". They have shown that the quotient nearlattice R S is weakly complemented. Moreover, R S is distributive if and only if S is 0-distributive. They also proved that every Sectionally complemented nearlattice S in which every interval [ ] x , 0 is unicomplemented is SemiBoolean if and only if S is 0-distributive. 1. Introduction J.C. Varlet [5] has given the definition of a 0-distributive lattice to generalize the notion of pseudocomplemented lattice. Then many authors including [1] and [3] studied the 0-distributive properties in lattices and meet semilattices. Recently, [6] have studied the 0-distributive nearlattices. A nearlattice is a meet semilattice together with the property that any two elements possessing a common upper bound have a supremum. This property is known as the upper bound property. A nearlattice S is called distributive if for all

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A NOTE ON CONGRUENCE LATTICES OF DISTRIBUTIVE p–ALGEBRAS

A (distributive) p-algebra is an algebra 〈L;∨,∧, ∗, 0, 1〉 whose reduct 〈L;∨,∧, 0, 1〉 is a bounded (distributive) lattice and whose unary operation ∗ is characterized by x ≤ a if and only if a ∧ x = 0. If L is a p-algebra, B(L) = { x ∈ L : x = x } and D(L) = { x ∈ L : x = 1 } then 〈B(L);∪,∧, 0, 1〉 is a Boolean algebra when a ∪ b is defined to be (a∗ ∧ b∗)∗, for any a, b ∈ B(L), D∗(L) = { x ∨ x∗ ...

متن کامل

Homomorphisms of relational systems and the corresponding groupoids

A nearlattice is a meet semilattice A in which every initial segment Ap := {x : x ≤ p} happens to be a join semilattice (hence, a lattice) with respect to the natural ordering of A. If all lattices Ap are distributive, the nearlattice itself is said to be distributive. It is known that a distributive nearlattice can be represented as a nearlattice of sets. We call an algebra (A,∧,∨) of type (2,...

متن کامل

On Semi Prime Ideals in Nearlattices

Recently Yehuda Rav has given the concept of Semi prime ideals in a general lattice by generalizing the notion of 0-distributive lattices. In this paper we study several properties of these ideals in a general nearlattice and include some of their characterizations. We give some results regarding maximal filters and include a number of Separation properties in a general nearlattice with respect...

متن کامل

Characterizations of m - Normal Nearlattices in terms of Principal n - Ideals

A convex subnearlattice of a nearlattice S containing a fixed element n∈S is called an n-ideal. The n-ideal generated by a single element is called a principal n-ideal. The set of finitely generated principal nideals is denoted by Pn(S), which is a nearlattice. A distributive nearlattice S with 0 is called m-normal if its every prime ideal contains at most m number of minimal prime ideals. In t...

متن کامل

The Structure of Pseudocomplemented Distributive Lattices. Ii: Congruence Extension and Amalgamation

This paper continues the examination of the structure of pseudocomplemented distributive lattices. First, the Congruence Extension Property is proved. This is then applied to examine properties of the equational classes ¿Sn, — lá«So), which is a complete list of all the equational classes of pseudocomplemented distributive lattices (see Part I). The standard semigroups (i.e., the semigroup gene...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013